Elementary proof techniques for the maximum number of islands
نویسندگان
چکیده
Abstract. Islands are combinatorial objects that can be intuitively defined on a board consisting of a finite number of cells. Based on the neighbor relation of the cells, it is a fundamental property that two islands are either containing or disjoint. Recently, numerous extremal questions have been answered using different methods. We show elementary techniques unifying these approaches. Our building parts are based on rooted binary trees and discrete geometry. Among other things, we show the maximum cardinality of islands on a toroidal board and in a hypercube. We also strengthen a previous result by rarefying the neighborhood relation.
منابع مشابه
SURVEY ON ISLANDS – a possible research topic, even for students
In recent algebra investigations, the maximum number of islands on some grid turned out to appear as interesting combinatorial problem. The aim of this paper is to overview the history and the results in this topic. The first result, the formula of Gábor Czédli appeared in [2], his proof was based on lattice theory. The investigation went on two different directions, nowadays both are living re...
متن کاملTribal Community Visit to Malaria-Endemic Areas Can Pose Risk to Car Nicobar Island: Deterrent for Malaria Elimination
Introduction: In the past 10 years, a declining trend was seen in the annual parasite incidence (API) of malaria in the Car Nicobar Island. For the past few years, the API in the island has been below one. Car Nicobar Island is struggling with malaria cases reported to have been brought from other, malaria-endemic islands. Methods: The movements of people...
متن کاملA short proof of the maximum conjecture in CR dimension one
In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملAn Alternative Stability Proof for Direct Adaptive Function Approximation Techniques Based Control of Robot Manipulators
This short note points out an improvement on the robust stability analysis for electrically driven robots given in the paper. In the paper, the author presents a FAT-based direct adaptive control scheme for electrically driven robots in presence of nonlinearities associated with actuator input constraints. However, he offers not suitable stability analysis for the closed-loop system. In other w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 32 شماره
صفحات -
تاریخ انتشار 2011